Invariant Graph Partition Comparison Measures
نویسندگان
چکیده
منابع مشابه
On the Variance-Type Graph Irregularity Measures
Bell's degree-variance Var$!{}_{B}$ for a graph $G$, with the degree sequence ($d_1,d_2,cdots,d_n$) and size $m$, is defined as$Var!_{B} (G)=frac{1}{n} sum _{i=1}^{n}left[d_{i} -frac{2m}{n}right]^{2}$.In this paper, a new version of the irregularity measures of variance-type, denoted by $Var_q$, is introduced and discussed. Based on a comparative study, it is demonstrated that the n...
متن کاملDense & Sparse Graph Partition
In a graph G = (V, E), the density is the ratio between the number of edges |E| and the number of vertices |V |. This criterion may be used to find communities in a graph: groups of highly connected vertices. We propose an optimization problem based on this criterion, the idea is to find the vertex partition that maximizes the sum of the densities of each class. We prove that this problem is NP...
متن کاملWord Segmentation as Graph Partition
We propose a new approach to the Chinese word segmentation problem that considers the sentence as an undirected graph, whose nodes are the characters. One can use various techniques to compute the edge weights that measure the connection strength between characters. Spectral graph partition algorithms are used to group the characters and achieve word segmentation. We follow the graph partition ...
متن کاملExploring invariant sets and invariant measures.
We propose a method to explore invariant measures of dynamical systems. The method is based on numerical tools which directly compute invariant sets using a subdivision technique, and invariant measures by a discretization of the Frobenius-Perron operator. Appropriate visualization tools help to analyze the numerical results and to understand important aspects of the underlying dynamics. This w...
متن کاملA Comparison of Centrality Measures for Graph-Based Keyphrase Extraction
In this paper, we present and compare various centrality measures for graphbased keyphrase extraction. Through experiments carried out on three standard datasets of different languages and domains, we show that simple degree centrality achieve results comparable to the widely used TextRank algorithm, and that closeness centrality obtains the best results on short documents.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2018
ISSN: 2073-8994
DOI: 10.3390/sym10100504